0.04/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.14/0.14 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.14/0.35 % Computer : n004.cluster.edu 0.14/0.35 % Model : x86_64 x86_64 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.35 % Memory : 8042.1875MB 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 1200 0.14/0.36 % WCLimit : 120 0.14/0.36 % DateTime : Tue Jul 13 12:52:39 EDT 2021 0.14/0.36 % CPUTime : 0.14/0.36 % Number of cores: 8 0.14/0.36 % Python version: Python 3.6.8 0.14/0.36 # Version: 2.6rc1-ho 0.14/0.36 # No SInE strategy applied 0.14/0.36 # Trying AutoSched0 for 59 seconds 5.49/5.67 # AutoSched0-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN 5.49/5.67 # and selection function SelectComplexExceptUniqMaxHorn. 5.49/5.67 # 5.49/5.67 # Preprocessing time : 0.051 s 5.49/5.67 # Presaturation interreduction done 5.49/5.67 5.49/5.67 # Proof found! 5.49/5.67 # SZS status Theorem 5.49/5.67 # SZS output start CNFRefutation 5.49/5.67 thf(two_ax, axiom, (two)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ X2)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', two_ax)). 5.49/5.67 thf(succ_ax, axiom, (succ)=(^[X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:X1 @ (X3 @ X1 @ X2)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', succ_ax)). 5.49/5.67 thf(three_ax, axiom, (three)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ (X1 @ X2))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', three_ax)). 5.49/5.67 thf(zero_ax, axiom, (zero)=(^[X1:$i > $i, X2:$i]:X2), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', zero_ax)). 5.49/5.67 thf(thm, conjecture, ?[X3:($i > $i) > $i > $i]:(plus @ X3 @ three)=(four), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', thm)). 5.49/5.67 thf(four_ax, axiom, (four)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ (X1 @ (X1 @ X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', four_ax)). 5.49/5.67 thf(plus_ax, axiom, (plus)=(^[X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:X4 @ X1 @ (X3 @ X1 @ X2)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', plus_ax)). 5.49/5.67 thf(c_0_7, plain, ![X1:$i > $i, X2:$i]:(two @ X1 @ X2)=(X1 @ (X1 @ X2)), inference(fof_simplification,[status(thm)],[two_ax])). 5.49/5.67 thf(c_0_8, plain, ![X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:(succ @ X3 @ X1 @ X2)=(X1 @ (X3 @ X1 @ X2)), inference(fof_simplification,[status(thm)],[succ_ax])). 5.49/5.67 thf(c_0_9, plain, ![X1:$i > $i, X2:$i]:(three @ X1 @ X2)=(X1 @ (X1 @ (X1 @ X2))), inference(fof_simplification,[status(thm)],[three_ax])). 5.49/5.67 thf(c_0_10, plain, ![X10:$i > $i, X11:$i]:(two @ X10 @ X11)=(X10 @ (X10 @ X11)), inference(variable_rename,[status(thm)],[c_0_7])). 5.49/5.67 thf(c_0_11, plain, ![X28:($i > $i) > $i > $i, X29:$i > $i, X30:$i]:(succ @ X28 @ X29 @ X30)=(X29 @ (X28 @ X29 @ X30)), inference(variable_rename,[status(thm)],[c_0_8])). 5.49/5.67 thf(c_0_12, plain, ![X12:$i > $i, X13:$i]:(three @ X12 @ X13)=(X12 @ (X12 @ (X12 @ X13))), inference(variable_rename,[status(thm)],[c_0_9])). 5.49/5.67 thf(c_0_13, plain, ![X1:$i > $i, X2:$i]:(two @ X1 @ X2)=(X1 @ (X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_10])). 5.49/5.67 thf(c_0_14, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(succ @ X3 @ X1 @ X2)=(X1 @ (X3 @ X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_11])). 5.49/5.67 thf(c_0_15, plain, ![X1:$i > $i, X2:$i]:(zero @ X1 @ X2)=(X2), inference(fof_simplification,[status(thm)],[zero_ax])). 5.49/5.67 thf(c_0_16, negated_conjecture, ~(?[X3:($i > $i) > $i > $i]:(plus @ X3 @ three)=(four)), inference(assume_negation,[status(cth)],[thm])). 5.49/5.67 thf(c_0_17, plain, ![X1:$i > $i, X2:$i]:(four @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ X2)))), inference(fof_simplification,[status(thm)],[four_ax])). 5.49/5.67 thf(c_0_18, plain, ![X1:$i > $i, X2:$i]:(three @ X1 @ X2)=(X1 @ (X1 @ (X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_12])). 5.49/5.67 thf(c_0_19, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(X1 @ (succ @ X3 @ X1 @ X2))=(two @ X1 @ (X3 @ X1 @ X2)), inference(spm,[status(thm)],[c_0_13, c_0_14])). 5.49/5.67 thf(c_0_20, plain, ![X6:$i > $i, X7:$i]:(zero @ X6 @ X7)=(X7), inference(variable_rename,[status(thm)],[c_0_15])). 5.49/5.67 thf(c_0_21, negated_conjecture, ![X39:($i > $i) > $i > $i]:(plus @ X39 @ three)!=(four), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])). 5.49/5.67 thf(c_0_22, plain, ![X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:(plus @ X4 @ X3 @ X1 @ X2)=(X4 @ X1 @ (X3 @ X1 @ X2)), inference(fof_simplification,[status(thm)],[plus_ax])). 5.49/5.67 thf(c_0_23, plain, ![X14:$i > $i, X15:$i]:(four @ X14 @ X15)=(X14 @ (X14 @ (X14 @ (X14 @ X15)))), inference(variable_rename,[status(thm)],[c_0_17])). 5.49/5.67 thf(c_0_24, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(X1 @ (two @ X1 @ (X3 @ X1 @ X2)))=(three @ X1 @ (X3 @ X1 @ X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_14]), c_0_19])). 5.49/5.67 thf(c_0_25, plain, ![X1:$i > $i, X2:$i]:(zero @ X1 @ X2)=(X2), inference(split_conjunct,[status(thm)],[c_0_20])). 5.49/5.67 thf(c_0_26, negated_conjecture, ![X3:($i > $i) > $i > $i]:(plus @ X3 @ three)!=(four), inference(split_conjunct,[status(thm)],[c_0_21])). 5.49/5.67 thf(c_0_27, plain, ![X31:($i > $i) > $i > $i, X32:($i > $i) > $i > $i, X33:$i > $i, X34:$i]:(plus @ X31 @ X32 @ X33 @ X34)=(X31 @ X33 @ (X32 @ X33 @ X34)), inference(variable_rename,[status(thm)],[c_0_22])). 5.49/5.67 thf(c_0_28, plain, ![X1:$i > $i, X2:$i]:(four @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_23])). 5.49/5.67 thf(c_0_29, plain, ![X1:$i > $i, X2:$i]:(X1 @ (two @ X1 @ X2))=(three @ X1 @ X2), inference(spm,[status(thm)],[c_0_24, c_0_25])). 5.49/5.67 thf(c_0_30, negated_conjecture, ![X3:($i > $i) > $i > $i]:(plus @ X3 @ three @ (esk1_2 @ X3))!=(four @ (esk1_2 @ X3)), inference(neg_ext,[status(thm)],[c_0_26])). 5.49/5.67 thf(c_0_31, plain, ![X1:$i > $i, X2:$i]:(succ @ zero @ X1 @ X2)=(X1 @ X2), inference(spm,[status(thm)],[c_0_14, c_0_25])). 5.49/5.67 thf(c_0_32, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X4:($i > $i) > $i > $i, X2:$i]:(plus @ X3 @ X4 @ X1 @ X2)=(X3 @ X1 @ (X4 @ X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_27])). 5.49/5.67 thf(c_0_33, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(X1 @ (three @ X1 @ (X3 @ X1 @ X2)))=(four @ X1 @ (X3 @ X1 @ X2)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_14]), c_0_19]), c_0_29])). 5.49/5.67 thf(c_0_34, negated_conjecture, ![X3:($i > $i) > $i > $i]:(plus @ X3 @ three @ (esk1_2 @ X3) @ (esk3_1 @ X3))!=(four @ (esk1_2 @ X3) @ (esk3_1 @ X3)), inference(neg_ext,[status(thm)],[c_0_30])). 5.49/5.67 thf(c_0_35, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(plus @ (succ @ zero) @ X3 @ X1 @ X2)=(X1 @ (X3 @ X1 @ X2)), inference(spm,[status(thm)],[c_0_31, c_0_32])). 5.49/5.67 thf(c_0_36, plain, ![X1:$i > $i, X2:$i]:(X1 @ (three @ X1 @ X2))=(four @ X1 @ X2), inference(spm,[status(thm)],[c_0_33, c_0_25])). 5.49/5.67 thf(c_0_37, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36])]), ['proof']). 5.49/5.67 # SZS output end CNFRefutation 5.49/5.67 # Proof object total steps : 38 5.49/5.67 # Proof object clause steps : 17 5.49/5.67 # Proof object formula steps : 21 5.49/5.67 # Proof object conjectures : 7 5.49/5.67 # Proof object clause conjectures : 4 5.49/5.67 # Proof object formula conjectures : 3 5.49/5.67 # Proof object initial clauses used : 7 5.49/5.67 # Proof object initial formulas used : 7 5.49/5.67 # Proof object generating inferences : 8 5.49/5.67 # Proof object simplifying inferences : 5 5.49/5.67 # Training examples: 0 positive, 0 negative 5.49/5.67 # Parsed axioms : 29 5.49/5.67 # Removed by relevancy pruning/SinE : 0 5.49/5.67 # Initial clauses : 29 5.49/5.67 # Removed in clause preprocessing : 14 5.49/5.67 # Initial clauses in saturation : 15 5.49/5.67 # Processed clauses : 15938 5.49/5.67 # ...of these trivial : 761 5.49/5.67 # ...subsumed : 7570 5.49/5.67 # ...remaining for further processing : 7607 5.49/5.67 # Other redundant clauses eliminated : 7752 5.49/5.67 # Clauses deleted for lack of memory : 0 5.49/5.67 # Backward-subsumed : 981 5.49/5.67 # Backward-rewritten : 298 5.49/5.67 # Generated clauses : 331699 5.49/5.67 # ...of the previous two non-trivial : 302832 5.49/5.67 # Contextual simplify-reflections : 116 5.49/5.67 # Paramodulations : 277234 5.49/5.67 # Factorizations : 0 5.49/5.67 # NegExts : 16353 5.49/5.67 # Equation resolutions : 7754 5.49/5.67 # Propositional unsat checks : 0 5.49/5.67 # Propositional check models : 0 5.49/5.67 # Propositional check unsatisfiable : 0 5.49/5.67 # Propositional clauses : 0 5.49/5.67 # Propositional clauses after purity: 0 5.49/5.67 # Propositional unsat core size : 0 5.49/5.67 # Propositional preprocessing time : 0.000 5.49/5.67 # Propositional encoding time : 0.000 5.49/5.67 # Propositional solver time : 0.000 5.49/5.67 # Success case prop preproc time : 0.000 5.49/5.67 # Success case prop encoding time : 0.000 5.49/5.67 # Success case prop solver time : 0.000 5.49/5.67 # Current number of processed clauses : 6313 5.49/5.67 # Positive orientable unit clauses : 372 5.49/5.67 # Positive unorientable unit clauses: 29 5.49/5.67 # Negative unit clauses : 22 5.49/5.67 # Non-unit-clauses : 5890 5.49/5.67 # Current number of unprocessed clauses: 283611 5.49/5.67 # ...number of literals in the above : 801545 5.49/5.67 # Current number of archived formulas : 0 5.49/5.67 # Current number of archived clauses : 1294 5.49/5.67 # Clause-clause subsumption calls (NU) : 24622517 5.49/5.67 # Rec. Clause-clause subsumption calls : 12796848 5.49/5.67 # Non-unit clause-clause subsumptions : 8471 5.49/5.67 # Unit Clause-clause subsumption calls : 53392 5.49/5.67 # Rewrite failures with RHS unbound : 0 5.49/5.67 # BW rewrite match attempts : 12739 5.49/5.67 # BW rewrite match successes : 1771 5.49/5.67 # Condensation attempts : 0 5.49/5.67 # Condensation successes : 0 5.49/5.67 # Termbank termtop insertions : 4255015 5.49/5.69 5.49/5.69 # ------------------------------------------------- 5.49/5.69 # User time : 5.166 s 5.49/5.69 # System time : 0.157 s 5.49/5.69 # Total time : 5.323 s 5.49/5.69 # Maximum resident set size: 1676 pages 5.49/5.69 EOF